Decompositions of complete symmetric directed graphs into the oriented heptagons
نویسندگان
چکیده
The complete symmetric directed graph of order $v$, denoted by $K_{v}$, is the on $v$~vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair distinct vertices $x$ and~$y$. For a given $D$, set all $v$ which $K_{v}$ admits $D$-decomposition called spectrum of~$D$-decomposition. There are 10 nonisomorphic orientations $7$-cycle (heptagon). In this paper, we completely settled problem oriented heptagons.
منابع مشابه
Decompositions of complete graphs into circulants
Let C(n;S) be a fixed circulant. The main problem is to determine the spectrum for values of v such that the complete graph Kv admits an edge-disjoint decomposition into subgraphs each of which is isomorphic to C(n;S). A complete solution in not to be expected since some instances correspond to famous existence problems (for instance, the existence of BIBD’s with λ = 1). On the other hand, the ...
متن کاملOn Cyclic Decompositions of Complete Graphs into Tripartite Graphs
We introduce two new labelings for tripartite graphs and show that if a graph G with n edges admits either of these labelings, then there exists a cyclic G-decomposition of K2nx+1 for every positive integer x. We also show that if G is the union of two vertext-disjoint cycles of odd length, other than C3 ∪ C3, then G admits one of these labelings.
متن کاملTrees with Α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of K2n into spanning trees, arising from the trees with α-labelings.
متن کاملThe decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
In this paper a graph is considered as finite, undirected, with single lines and no loops. The arboricity of a graph G, denoted by Y(G), is the least number of line-disjoint spanning forests into which G can be partitioned. {x} is the least integer not less than X, and A(G) is the maximum degree among the points of G. V(G), E(G), and ISI denote the point set of G, the line set of G, and the num...
متن کاملCycle decompositions V: Complete graphs into cycles of arbitrary lengths
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m1, . . . ,mt if and only if n is odd, 3 ≤ mi ≤ n for i = 1, . . . , t, and m1+· · ·+mt = ( n 2 ) . We also show that the complete graph on n vertices can be decomposed into a perfect matching and t cycles of specified lengths m1, . . . ,mt if and only if n is even, 3 ≤ mi ≤ n for i = 1, . . . , t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish Journal of Mathematics
سال: 2021
ISSN: ['1303-6149', '1300-0098']
DOI: https://doi.org/10.3906/mat-2007-54